A construction heuristic for finding an initial solution to a very large-scale capacitated vehicle routing problem

In this paper, a deterministic heuristic method is developed for obtaining an initial solution to extremely large-scale capacitated vehicle routing problem (CVRP) having thousands of customers. The has three main objectives. First, it should be able withstand the computational and memory problems normally associated with CVRP. Secondly, outputs reasonably accurate have minimum number vehicles. Finally, produce results within short duration time. new method, based on sweep algorithm, minimizes vehicles by loading nearly their full capacity skipping some customers as when necessary. To minimize total traveled distance, before sweeping starts are ordered both polar angle distance customer from depot. This tested 10 sets standard benchmark instances found in literature. compared CW 100 Arnold et al . [ Comput. Oper. Res. 107 (2019) 32–42]. indicate that modified algorithm produces reasonable accuracy. deviation output best-known (BKS) all test instances. When provides better than whenever more depot located eccentrically. does not face any solving